Descartes' Rule of Signs
نویسنده
چکیده
In this work, we formally proved Descartes Rule of Signs, which relates the number of positive real roots of a polynomial with the number of sign changes in its coefficient list. Our proof follows the simple inductive proof given by Arthan [1], which was also used by John Harrison in his HOL Light formalisation. We proved most of the lemmas for arbitrary linearly-ordered integrity domains (e.g. integers, rationals, reals); the main result, however, requires the intermediate value theorem and was therefore only proven for real polynomials.
منابع مشابه
Counting zeros of generalized polynomials: Descartes’ rule of signs and Laguerre’s extensions
A slightly different question is how many positive zeros a polynomial has. Here the basic result is known as “Descartes’ rule of signs”. It says that the number of positive zeros is no more than the number of sign changes in the sequence of coefficients. Descartes included it in his treatise La Géométrie, which appeared in 1637. It can be proved by a method based on factorization, but, again, j...
متن کاملDescartes' Rule of Signs for Polynomial Systems supported on Circuits
We give the first multivariate version of Descartes’ rule of signs to bound the number of positive real roots of a system of polynomial equations in n variables with n+2 monomials, in terms of the sign variation of a sequence associated both to the exponent vectors and the given coefficients. We show that our bound is sharp and is related to the signature of the circuit.
متن کاملReal root isolation for exact and approximate polynomials using Descartes' rule of signs
Collins und Akritas (1976) have described the Descartes method for isolating the real roots of an integer polynomial in one variable. This method recursively subdivides an initial interval until Descartes’ Rule of Signs indicates that all roots have been isolated. The partial converse of Descartes’ Rule by Obreshkoff (1952) in conjunction with the bound of Mahler (1964) and Davenport (1985) lea...
متن کاملDescartes' Rule of Signs for Radial Basis Function Neural Networks
We establish versions of Descartes' rule of signs for radial basis function (RBF) neural networks. The RBF rules of signs provide tight bounds for the number of zeros of univariate networks with certain parameter restrictions. Moreover, they can be used to infer that the Vapnik-Chervonenkis (VC) dimension and pseudodimension of these networks are no more than linear. This contrasts with previou...
متن کاملA Problem of P olya Concerning Polynomials Which Obey Descartes ' Rule of Signs
We formulate and duscuss two open problems. The rst one is due to PP olya. It states that the sequence of polynomials formed by a polynomial p with only real zeros and all its derivatives, obeys Descartes' rule of signs for any x, greater than the largest zero of p. The other problem is due to Karlin and states that certain Hankel determinants associated with an entire function in the Laguerre-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Archive of Formal Proofs
دوره 2015 شماره
صفحات -
تاریخ انتشار 2015